Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
941	SWFRPC BIENNIAL REVIEW SUMMARY TABLE[removed]a)(b) Add to Reading List Source URL: www.swfrpc.org Language: English - Date: 2012-04-05 13:45:40 Complexity classes NP
942	DAVID S. JOHNSON Address: 523 Computer Science Building Mail Code 0401 Department of Computer Science Add to Reading List Source URL: davidsjohnson.net Language: English - Date: 2014-01-22 11:11:57 Complexity classes Bin packing problem NP-complete ACM SIGACT Crossing number Linear programming Randomized algorithm Edward G. Coffman Jr. Computers and Intractability: A Guide to the Theory of NP-Completeness Theoretical computer science Applied mathematics Computational complexity theory
943	On the Incompressibility of Monotone DNFs Matthias P. Krieger∗ Johann Wolfgang Goethe-Universit¨at Frankfurt am Main Institut f¨ ur Informatik Lehrstuhl f¨ Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2010-11-03 11:40:59 Circuit complexity Computational complexity theory Boolean algebra Complexity classes Implicant Logic in computer science Boolean circuit Circuit ACC0 Theoretical computer science Mathematics Applied mathematics
944	Computer Science / Mathematics 340 General Information Instructor: Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-04-10 18:04:10 Sorting algorithms Computational complexity theory Mathematical optimization Complexity classes Operations research Algorithm Greedy algorithm Quicksort Insertion sort Mathematics Theoretical computer science Applied mathematics
945	The Role of Decidability in First Order Separations over Classes of Finite Structures Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:31 Mathematical logic Complexity classes Computational complexity theory FO Descriptive complexity Model theory SO Descriptive complexity theory P Theoretical computer science Finite model theory Mathematics
946	[removed]Motivation Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:14 FO P Finite model theory SO Computational complexity theory Second-order logic Theoretical computer science Complexity classes Applied mathematics
947	3 Complexity of Reasoning Francesco M. Donini Add to Reading List Source URL: www.inf.unibz.it Language: English - Date: 2011-09-08 09:53:48 Complexity classes Finite model theory Boolean algebra Predicate logic Boolean satisfiability problem True quantified Boolean formula NP-complete Description logic FO Theoretical computer science Computational complexity theory Applied mathematics
948	INFORMATION TECHNOLOGY THE LIMITSOF Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-04-30 09:54:41 Complexity classes Quantum information science Mathematical optimization Quantum algorithm Quantum computer P versus NP problem NP-complete NP BQP Theoretical computer science Applied mathematics Computational complexity theory
949	Framework Proofs One prover proofs Two prover games Written proofs PCP-theorem Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2005-08-04 03:11:39 Probabilistic complexity theory Cryptographic protocols IP Probabilistically checkable proof NP Soundness Mathematical proof P Interactive proof system Theoretical computer science Applied mathematics Complexity classes
950	The Limits of Quantum Computers (DRAFT) Scott Aaronson For the published version—which differs significantly from this one—please see the March 2008 issue of Scientific American. “Haggar Physicists Develop ‘Quant Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-04-30 09:54:41 Complexity classes Mathematical optimization Quantum complexity theory NP-complete P versus NP problem Quantum computer Quantum algorithm NP PP Theoretical computer science Applied mathematics Computational complexity theory